Close

1. Identity statement
Reference TypeConference Paper (Conference Proceedings)
Sitesibgrapi.sid.inpe.br
Holder Codeibi 8JMKD3MGPEW34M/46T9EHH
Identifier83LX3pFwXQZ4BFjAq/jiGTc
Repositorydpi.inpe.br/vagner/1999/11.29.09.27
Last Update2000:01.03.02.00.00 (UTC) administrator
Metadata Repositorysid.inpe.br/banon/2001/03.30.15.58.04
Metadata Last Update2022:06.14.00.17.07 (UTC) administrator
DOI10.1109/SIBGRA.1999.805729
Citation KeyConciAqui:1999:UsAdCo
TitleUsing adaptive contraction for fractal image coding based on local fractal dimension
Year1999
Access Date2024, May 02
Number of Files3
Size880 KiB
2. Context
Author1 Conci, Aura
2 Aquino, Felipe R.
EditorStolfi, Jorge
Tozzi, Clésio Luis
Conference NameBrazilian Symposium on Computer Graphics and Image Processing, 12 (SIBGRAPI)
Conference LocationCampinas, SP, Brazil
Date17-20 Oct. 1999
PublisherIEEE Computer Society
Publisher CityLos Alamitos
Pages231-239
Book TitleProceedings
Tertiary TypeFull Paper
OrganizationSBC - Brazilian Computer Society and UNICAMP - University of Campinas
History (UTC)2008-07-17 14:17:59 :: administrator -> banon ::
2008-08-26 15:23:57 :: banon -> administrator ::
2009-08-13 20:36:21 :: administrator -> banon ::
2010-08-28 20:04:55 :: banon -> administrator ::
2022-06-14 00:17:07 :: administrator -> :: 1999
3. Content and structure
Is the master or a copy?is the master
Content Stagecompleted
Transferable1
Version Typefinaldraft
Keywordsfractal dimension
fractal compression
partitioned iterated function system-pifs
image compression
AbstractIn automatic fractal image compression, most of the encoding time is spent on finding the best match between each range block and the domain blocks. We propose the use of the local compexity of the image domain blocks to reduce the number of pairs to be tested on this search. Indexing the contracted domain pools according to their local fractal dimension and using multiple contraction factors we can confine all potential matches to a relatively small number of possibilities. By selecting an appropriate criterion for close match, the compression time can be shortened without image quality degradation. The performance of the proposed algorithm, evaluated by means of fidelity versus encoding time and compression ratio, is compared with five approaches. Future developments can also improve the compression ratio by using fractal dimension in the definition of the size of range blocks.
Arrangement 1urlib.net > SDLA > Fonds > SIBGRAPI 1999 > Using adaptive contraction...
Arrangement 2urlib.net > SDLA > Fonds > Full Index > Using adaptive contraction...
doc Directory Contentaccess
source Directory Contentthere are no files
agreement Directory Contentthere are no files
4. Conditions of access and use
data URLhttp://urlib.net/ibi/83LX3pFwXQZ4BFjAq/jiGTc
zipped data URLhttp://urlib.net/zip/83LX3pFwXQZ4BFjAq/jiGTc
Target File025-83114570.pdf
User Groupadministrator
Visibilityshown
5. Allied materials
Next Higher Units8JMKD3MGPEW34M/46PDF8P
8JMKD3MGPEW34M/4742MCS
Citing Item Listsid.inpe.br/sibgrapi/2022/04.25.03.44 9
Host Collectionsid.inpe.br/banon/2001/03.30.15.38
6. Notes
NotesThe conference was held in Campinas, SP, Brazil, from October 17 to 20.
Empty Fieldsaffiliation archivingpolicy archivist area callnumber contenttype copyholder copyright creatorhistory descriptionlevel dissemination documentstage e-mailaddress edition electronicmailaddress format group isbn issn label language lineage mark mirrorrepository nextedition numberofvolumes orcid parameterlist parentrepositories previousedition previouslowerunit progress project readergroup readpermission resumeid rightsholder schedulinginformation secondarydate secondarykey secondarymark secondarytype serieseditor session shorttitle sponsor subject tertiarymark type url volume


Close